Characterizing contextual equivalence in calculi with passivation
نویسندگان
چکیده
We study the problem of characterizing contextual equivalence in higher-orderlanguages with passivation. To overcome the difficulties arising in the proofof congruence of candidate bisimilarities, we introduce a new form of labelledtransition semantics together with its associated notion of bisimulation, whichwe call complementary semantics. Complementary semantics allows to applythe well-known Howe’s method for proving the congruence of bisimilarities ina higher-order setting, even in presence of an early form of bisimulation. Weuse complementary semantics to provide a coinductive characterization of con-textual equivalence in the HOπP calculus, an extension of the higher-order π-calculus with passivation, obtaining the first result of this kind. We then studythe problem of defining a more effective variant of bisimilarity that still char-acterizes contextual equivalence, along the lines of Sangiorgi’s notion of normalbisimilarity. We provide partial results on this difficult problem: we show thata large class of test processes cannot be used to derive a normal bisimilarity inHOπP, but we show that a form of normal bisimilarity can be defined for HOπPwithout restriction.
منابع مشابه
Symbolic Bisimulation for a Higher-Order Distributed Language with Passivation!
We study the behavioural theory of a higher-order distributed calculus with private names and locations that can be passivated. For this language, we present a novel Labelled Transition System where higher-order inputs are symbolic agents that can perform a limited number of transitions, capturing the nature of passivation. Standard first-order weak bisimulation over this LTS coincides with con...
متن کاملHowe's Method for Calculi with Passivation
We show how to apply Howe’s method for the proof of congruence of early bisimilarities in a higher-order process calculus with passivation. This involves the introduction of a proof technique based on a new kind of transition system and bisimilarity, called complementary semantics. We show that complementary semantics is equivalent to contextual semantics, originally introduced by Sangiorgi, th...
متن کاملReasoning about Contextual Equivalence: From Untyped to Polymorphically Typed Calculi
This paper describes a syntactical method for contextual equivalence in polymorphically typed lambda-calculi. Our specific calculus has letrec as cyclic let, data constructors, case-expressions, seq, and recursive types. The typed language is a subset of the untyped language. Normal-order reduction is defined for the untyped language. Since there are less typed contexts the typed contextual pre...
متن کاملO / 0 61 21 06 v 1 21 D ec 2 00 6 On completeness of logical relations for monadic types ⋆
Software security can be ensured by specifying and verifying security properties of software using formal methods with strong theoretical bases. In particular, programs can be modeled in the framework of lambda-calculi, and interesting properties can be expressed formally by contextual equivalence (a.k.a. observational equivalence). Furthermore, imperative features, which exist in most real-lif...
متن کاملContextual Equivalence for the Pi-Calculus that can Stop
The pi-calculus is a well-analyzed model for mobile processes and mobile computations. While a lot of other process and lambda calculi that are core languages of higher-order concurrent and/or functional programming languages use a contextual semantics observing the termination behavior of programs in all program contexts, traditional program equivalences in the pi-calculus are bisimulations an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Comput.
دوره 209 شماره
صفحات -
تاریخ انتشار 2011